On treewidth approximations
نویسندگان
چکیده
منابع مشابه
On Low Treewidth Approximations of Conjunctive Queries
We recently initiated the study of approximations of conjunctive queries within classes that admit tractable query evaluation (with respect to combined complexity). Those include classes of acyclic, bounded treewidth, or bounded hypertreewidth queries. Such approximations are always guaranteed to exist. However, while for acyclic and bounded hypertreewidth queries we have shown a number of exam...
متن کاملTreewidth and the Computational Complexity of MAP Approximations
The problem of finding the most probable explanation to a designated set of variables (the MAP problem) is a notoriously intractable problem in Bayesian networks, both to compute exactly and to approximate. It is known, both from theoretical considerations and from practical experiences, that low treewidth is typically an essential prerequisite to efficient exact computations in Bayesian networ...
متن کاملOn Treewidth and Stable Marriage
Stable Marriage is a fundamental problem to both computer science and economics. Four well-known NP-hard optimization versions of this problem are the Sex-Equal Stable Marriage (SESM), Balanced Stable Marriage (BSM), max-Stable Marriage with Ties (max-SMT) and min-Stable Marriage with Ties (min-SMT) problems. In this paper, we analyze these problems from the viewpoint of Parameterized Complexit...
متن کاملA note on domino treewidth
In [3], Bodlaender and Engelfriet proved that for every k, and d, there exists a constant ck;d, such that every graph with treewidth at most k and maximum degree at most d has domino treewidth at most ck;d. This note gives a new, simpler proof of this fact, with a much better bound for ck;d, namely (9k + 7)d(d+ 1) 1. It is also shown that a lower bound of (kd) holds: there are graphs with domin...
متن کاملComputing Treewidth on the GPU
We present a parallel algorithm for computing the treewidth of a graph on a GPU. We implement this algorithm in OpenCL, and experimentally evaluate its performance. Our algorithm is based on an O(2)-time algorithm that explores the elimination orderings of the graph using a HeldKarp like dynamic programming approach. We use Bloom filters to detect duplicate solutions. GPU programming presents u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00440-2